package leetcode.code0865;

import leetcode.IDebug;
import leetcode.helper.HelpDebug;
import leetcode.helper.tree.TreeArray;
import leetcode.helper.tree.TreeNode;

public abstract class S865 implements IDebug {

	public abstract TreeNode subtreeWithAllDeepest(TreeNode root);

	@Override
	public void debug1() {
		HelpDebug.compare(TreeArray.array2tree(HelpDebug.str2array4("[2,7,4]")),
				this.subtreeWithAllDeepest(TreeArray.array2tree(HelpDebug.str2array4("[3,5,1,6,2,0,8,null,null,7,4]"))));

	}

	@Override
	public void debug2() {
		HelpDebug.compare(TreeArray.array2tree(HelpDebug.str2array4("[1]")),
				this.subtreeWithAllDeepest(TreeArray.array2tree(HelpDebug.str2array4("[1]"))));

	}

	@Override
	public void debug3() {
		HelpDebug.compare(TreeArray.array2tree(HelpDebug.str2array4("[2]")),
				this.subtreeWithAllDeepest(TreeArray.array2tree(HelpDebug.str2array4("[0,1,3,null,2]"))));

	}

	@Override
	public void debug4() {
		// TODO Auto-generated method stub

	}

}
